Concepts and Methods for a Librarian of the Web by Mario Kubek

Author:Mario Kubek
Language: eng
Format: epub
ISBN: 9783030231361
Publisher: Springer International Publishing

If a set of uniform, discrete mass points in a 2-dimensional, Euclidean plane with an underlying rectangular grid is considered, one would try to fix the centre of mass in the intersection of concentric cycles of the same radius around those points (Fig. 6.5).

Fig. 6.5Locating the centre of mass in the 2-dimensional plane

Things may look more complex in a usual co-occurrence graph, since it can normally not be embedded in a 2- or 3-dimensional space, which humans can easily imagine. However, similar ideas of a neighbourhood allocation have already been used to provide a graph clustering method [121]. The already mentioned Chinese Whispers algorithm [11] is another interesting and related solution for efficient graph clustering that relies on a label propagation technique. The following algorithm adapts the idea described above and can be applied on large co-occurrence graphs quite fast.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.